Achieving Efficient and Provably Secure Steganography in Practice

نویسنده

  • Aubrey Alston
چکیده

Steganography is the task of concealing a message within a medium such that the presence of the hidden message cannot be detected. Though the prospect of steganography is conceivably interesting in many contexts, and though work has been done both towards formalizing steganographic security and providing provably secure constructions, little work exists attempting to provide efficient and provably secure steganographic schemes in specific, useful domains. Beginning from the starting point of the initial definition of steganographic security, I have engaged in an exploration which has developed to include two primary tasks, both pointing towards the realization of efficient and secure steganographic systems in practice: (a) investigating the syntactic and semantic applicability of the current formalism of steganographic security to a broader range of potentially interesting domains and (b) constructing and implementing provably secure (symmetric-key) steganographic schemes in domains which are well-suited to the current formalism.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Artemia: a family of provably secure authenticated encryption schemes

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

متن کامل

Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC

Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...

متن کامل

Efficient Provably Secure Public Key Steganography

We construct efficient public key steganographic schemes, without resort to any special existence assumption such as unbiased functions. This is the first time such a construction is obtained. Not only our constructions are secure, but also are essentially optimal and have no error decoding. We achieve this by designing a new primitive called P-codes.

متن کامل

Provably Secure Steganography with Imperfect Sampling

The goal of steganography is to pass secret messages by disguising them as innocent-looking covertexts. Real world stegosystems are often broken because they make invalid assumptions about the system’s ability to sample covertexts. We examine whether it is possible to weaken this assumption. By modeling the covertext distribution as a stateful Markov process, we create a sliding scale between r...

متن کامل

More Efficient Provably Secure Steganography

Steganography is the science of hiding the very presence of a secret message within a public communication channel. In Crypto 2002, Hopper, Langford, and von Ahn proposed the first complexitytheoretic definition and constructions of stegosystems. They later pointed out and corrected a flaw in one of their basic constructions. The correction, unfortunately, introduced a need for expensive errorc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1707.00074  شماره 

صفحات  -

تاریخ انتشار 2017